Additive functionals on multiway search trees

ثبت نشده
چکیده

We derive asymptotics of moments and limiting distributions, under the random permutation model on m-ary search trees on n keys, of functionals that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal path length, and the socalled shape functional fall under this framework. The limiting behavior of these functionals exhibit intriguing phase changes. For suitably “small” input (or toll) sequences we have asymptotic normality if m ≤ 26 and typically periodic behavior otherwise. For “moderate” toll sequences we have convergence to non-normal distributions if m ≤ m0 (where m0 ≥ 26) and typically periodic behavior otherwise. For “large” toll sequences we have convergence to non-normal distributions for all values of m. Recent research greatly sharpens the understanding of the periodic cases. For example, Chauvin and Pouyanne have shown that for m ≥ 27 fixed, the space requirement equals

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A repertoire for additive functionals of uniformly distributed m - ary search trees ( Extended Abstract )

Using recent results on singularity analysis for Hadamard products of generating functions, we obtain the limiting distributions for additive functionals on m-ary search trees on n keys with toll sequence (i) n with α ≥ 0 (α = 0 and α = 1 correspond roughly to the space requirement and total path length, respectively); (ii) ln ` n m−1 ́ , which corresponds to the so-called shape functional; and ...

متن کامل

A REPERTOIRE FOR ADDITIVE FUNCTIONALS OF UNIFORMLY DISTRIBUTED m-ARY SEARCH TREES

Using recent results on singularity analysis for Hadamard products of generating functions, we obtain the limiting distributions for additive functionals on m-ary search trees on n keys with toll sequence (i) nα with α ≥ 0 (α = 0 and α = 1 correspond roughly to the space requirement and total path length, respectively); (ii) ln ( n m−1 ) , which corresponds to the socalled shape functional; and...

متن کامل

Limiting distributions for additive functionals on Catalan trees

Additive tree functionals represent the cost of many divide-andconquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) nα when α > 0 and (b) log n (the so-called shape functional) on uniformly distributed binary search trees, sometimes called Catalan trees. The Gaussian law obtained in the latter case complements the central ...

متن کامل

ADDITIVE FUNCTIONALS OF d-ARY INCREASING TREES

A tree functional is called additive if it satisfies a recursion of the form F (T ) = ∑k j=1 F (Bj)+f(T ), where B1, . . . , Bk are the branches of the tree T and f(T ) is a toll function. We prove a general central limit theorem for additive functionals of d-ary increasing trees under suitable assumptions on the toll function. The same method also applies to generalised planeoriented increasin...

متن کامل

Efficient Multiway Radix Search Trees

We present a new scheme for building static search trees, using multiway radix search. We apply this method to the problem of code generation for switch statements in imperative languages. For sparse case sets, the method has an advantage over existing methods, empirically requiring fewer than three branches for the average search. We give timing results that show that in practice our method ru...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006